An ACO algorithm for image compression

An ACO algorithm for image compression

This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compression and the results obtained are shown. According to the tests carried out, the proposed algorithm offers images with similar quality to that obtained with a deterministic method, in about 34% less time.

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

An Algorithm for Image Clustering and Compression

This paper presents a new approach to image compression based on fuzzy clustering. This new approach includes pre-filtering, and fuzzy logic image enhancing to reduce undesirable noise effects on segmentation result; separation of image into 4x4 blocks and two dimensional discrete cosine transform; obtaining of peak values of cosine membership functions by combining of performing the zig-zag me...

An Improved Algorithm for Image Compression Using Geometric Image Approximation

Our dependence on digital media continues to grow and therefore finding competent ways of storing and conveying these large amounts of data has become a major concern. The technique of image compression has then become very essential and highly applicable. In this paper, the performance of an efficient image coding method based on Geometric Wavelets that divides the desired image using a recurs...

An ACO Algorithm for the Shortest